Multiple Sequence Alignment Using Evolutionary Programming

نویسندگان

  • Kumar Chellapilla
  • Gary B. Fogel
چکیده

Multiple sequence alignment can be used as a tool for the identification of common structure in an ordered string of nucleotides (in DNA or RNA) or amino acids (in proteins). Current multiple sequence alignment algorithms work well for sequences with high similarity but do not scale well when either the length or number of the sequences is large or if the similarity is low. The focus of this paper is to develop an evolutionary programming (EP) algorithm for multiple sequence alignment. An EP method with representation specific variation operators is proposed and tested on several data sets. Comparisons to other algorithms suggests that this algorithm is wellsuited to the multiple sequence alignment problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Application of the ABS LX Algorithm to Multiple Sequence Alignment

We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...

متن کامل

Application of Evolutionary Algorithms for Multiple Sequence Alignment

Multiple Sequence Alignment is a crucial task in Bioinformatics. Most of the commonly used multiple alignment methods are based on a dynamic programming approach. This approach however requires time proportional to the product of the sequence lengths and also doesn’t provide an extensible platform for evaluating different objective functions. Tree-based algorithms, which combine results from pa...

متن کامل

Using guide trees to construct multiple-sequence evolutionary HMMs

MOTIVATION Score-based progressive alignment algorithms do dynamic programming on successive branches of a guide tree. The analogous probabilistic construct is an Evolutionary HMM. This is a multiple-sequence hidden Markov model (HMM) made by combining transducers (conditionally normalised Pair HMMs) on the branches of a phylogenetic tree. METHODS We present general algorithms for constructin...

متن کامل

An Analysis Based on Heuristic Method Using CLUSTAL and EMBOSS

The Multiple Sequence Alignment (MSA) methods aims to align several sequences together and find similarities, or differences and infer structural, functional or evolutionary relationships. Since a multiple sequence alignment problem can be solved by a well known dynamic programming algorithm have exponential time complexity, the heuristic approaches are commonly used. In this paper, multiple se...

متن کامل

An Evolutionary and Phylogenetic Study of the BMP15 Gene

DNA sequence data contains a wealth of biologically useful information. Recent innovations in DNA sequencing technology have greatly increased our capacity to determine massive amounts of nucleotide sequences. These sequences can be used to specify the characteristics of different regions, interpret the evolutionary relationships between categorized groups, likelihood of performing multiple com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999